Vertex identifying codes for the n-dimensional lattice
نویسنده
چکیده
An r-identifying code on a graph G is a set C ⊂ V (G) such that for every vertex in V (G), the intersection of the radius-r closed neighborhood with C is nonempty and different. Here, we provide an overview on codes for the n-dimensional lattice, discussing the case of 1-identifying codes, constructing a sparse code for the 4-dimensional lattice as well as showing that for fixed n, the minimum density of an r-identifying code is Θ(1/r).
منابع مشابه
On identifying codes in lattices
Let G(V,E) be a simple, undirected graph. An identifying code on G is a vertex-subset C ⊆ V such that B(v) ∩ C is non-empty and distinct for each vertex v ∈ V , where B(v) is a ball about v. Motivated by applications to fault diagnosis in multiprocessor arrays, a number of researchers have considered the problem of constructing identifying codes of minimum density on various two-dimensional lat...
متن کاملNew Bounds for Codes Identifying Vertices in Graphs
Let G = (V,E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For any vertex v ∈ V , the neighbouring set N(v,C) is the set of vertices of C at distance at most one from v. We say that the code C identifies the vertices of G if the neighbouring sets N(v,C), v ∈ V, are all nonempty and different. What is the smallest size of an identifying code C ? We focus on th...
متن کاملOn Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals
ÐFault diagnosis of multiprocessor systems motivates the following graph-theoretic definition. A subset C of points in an undirected graph G V ;E is called an identifying code if the sets B v \ C consisting of all elements of C within distance one from the vertex v are different. We also require that the sets B v \ C are all nonempty. We take G to be the infinite square lattice with diago...
متن کاملIdentifying Codes in q-ary Hypercubes
Let q be any integer ≥ 2. In this paper, we consider the q-ary ndimensional cube whose vertex set is Znq and two vertices (x1, . . . , xn) and (y1, . . . , yn) are adjacent if their Lee distance is 1. As a natural extension of identifying codes in binary Hamming spaces, we further study identifying codes in the above q-ary hypercube. We let M t (n) denote the smallest cardinality of t-identifyi...
متن کاملA New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid
Given a graph G, an identifying code D ⊆ V (G) is a vertex set such that for any two distinct vertices v1, v2 ∈ V (G), the sets N [v1] ∩ D and N [v2] ∩ D are distinct and nonempty (here N [v] denotes a vertex v and its neighbors). We study the case when G is the infinite hexagonal grid H. Cohen et.al. constructed two identifying codes for H with density 3/7 and proved that any identifying code ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 53 شماره
صفحات -
تاریخ انتشار 2012